Multi-multifractal decomposition of digraph recursive fractals
نویسندگان
چکیده
منابع مشابه
Multifractal Decompositions of Digraph Recursive Fractals
We prove that the multifractal decomposition behaves as expected for a family of sets K known as digraph recursive fractals, using measures ^ of Markov type. For each value of a parameter a between a minimum amin and maximum amax, we define 'multifractal components' K^ a) of K, and show that they are fractals in the sense of Taylor. The dimension /(or) of K^ is computed from the data of the pro...
متن کاملMultifractal Decompositions of Moran Fractals
We present a rigorous construction and generalization of the multifractal decomposition for Moran fractals with intinite product measure. The generalization is specilied by a system of nonnegative weights in the partition sum. All the usual (smooth) properties of thef(a) theory are recovered for the case that the weights are equal to unity. The generalized spectrum, !(a, r~), is invariant to a ...
متن کاملHamiltonian Decomposition of Recursive
We show that recursive circulant G(cd m ; d) is hamiltonian decomposable. Recursive circulant is a graph proposed for an interconnection structure of multicomputer networks in [8]. The result is not only a partial answer to the problem posed by Alspach that every connected Cayley graph over an abelian group is hamiltonian decomposable, but also an extension of Micheneau's that recursive circula...
متن کاملMulti-Engine Machine Translation by Recursive Sentence Decomposition
In this paper, we present a novel approach to combine the outputs of multiple MT engines into a consensus translation. In contrast to previous Multi-Engine Machine Translation (MEMT) techniques, we do not rely on word alignments of output hypotheses, but prepare the input sentence for multi-engine processing. We do this by using a recursive decomposition algorithm that produces simple chunks as...
متن کاملRecursive Schur Decomposition
In this article, we present a parallel recursive algorithm based on multi-level domain decomposition that can be used as a precondtioner to a Krylov subspace method to solve sparse linear systems of equations arising from the discretization of partial differential equations (PDEs). We tested the effectiveness of the algorithm on several PDEs using different number of sub-domains (ranging from 8...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista Matemática Iberoamericana
سال: 2001
ISSN: 0213-2230
DOI: 10.4171/rmi/291